Some 5∕2 transitive permutation groups

On Transitive Permutation Groups

We assign names and new generators to the transitive groups of degree up to 15, reflecting their structure.

Generating Transitive Permutation Groups

Constructing transitive permutation groups

This paper presents a new algorithm to classify all transitive subgroups of the symmetric group up to conjugacy. It has been used to determine the transitive groups of degree up to 30.

Abstract Groups as Doubly Transitive Permutation Groups *

Groups as Doubly Transitive Permutation Groups *

AUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS

An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...